Complexity and approximation for precedence constrained scheduling problems with large communication delays
نویسندگان
چکیده
منابع مشابه
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
A well studied and diicult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider precedence delays, associating with each precedence constraint a certain amount of time which must elapse between the completion and start times of the corresponding jobs. Release dates, among others, may be modeled in this fashi...
متن کاملApproximation algorithms for scheduling trees with general communication delays
1 Introduction
متن کاملScheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation
In the last few years, multi-processor scheduling with interprocessor communication delays has received increasing attention. This is due to the more realistic constraints in modeling parallel processor systems. Most research in this vein is concerned with the makespan criterion. We contribute to this work by presenting a new and simple ( 2 1)-approximation algorithm for scheduling to minimize ...
متن کاملApproximability of Precedence Constrained and Robust Scheduling Problems
This thesis studies the approximability of scheduling problems in different contexts. Chapter 2 gives a short introduction to the field of scheduling theory and presents a simple single machine scheduling problem that will form the base for all variants considered in the remainder of this thesis. We point out that this scheduling problem, though long known to be efficiently solvable in its orig...
متن کاملPrecedence-Constrained Scheduling Problems Parameterized by Partial Order Width
Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1–2):533–562), we show that P2|prec,pj∈{1, 2}|Cmax, the problem of finding a non-preemptive minimum-makespan schedule for precedence-constrained jobs of lengths 1 and 2 on two parallel identical machines, is W[2]-hard parameterized by the width of the partial order giving the precedence constraints. To this end, we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.03.027